منابع مشابه
On the Recursive Depth of Special Tree Traversal Algorithms
In this paper we are concerned with the analysis of special recursive algorithms for traversing the nodes of a planted plane tree (ordered tree ; planar tree) . Some by now classical results in this area are due to (de Bruijn, Knuth, and Rice, 1972 ; Knuth, 1973 ; Flajolet, 1981 ; Flajolet and Odlyzko, 1982 ; Flajolet, Raoult, and Vuillemin, 1979 ; Kemp, 1979) and others and are summarized in t...
متن کاملMerkle Tree Traversal Revisited
We propose a new algorithm for computing authentication paths in the Merkle signature scheme. Compared to the best algorithm for this task, our algorithm reduces the worst case running time considerably.
متن کاملTree-Traversal Orientation Analysis
This paper presents a profiling-based analysis to determine the traversal orientation of link-based tree data structures. Given the very-high memory-hierarchy latencies in modern computers, once the compiler has identified that a pointer-based data structure represents a tree, it would be useful to determine the predominant orientation of traversal for the tree. Optimizing compilers can impleme...
متن کاملParsing As Tree Traversal
This paper presents a unified approach to parsing, in which top-down, bot tomup and left-corner parsers m:e related to preorder, postorder and inorder tree traversals. It is shown that the simplest bo t tom-up and left-corner parsers are left recursive and must be converted using an extended Greibach normal form. With further partial execution, the bo t tom-up and left-corner parsers collapse t...
متن کاملA Bounded-Space Tree Traversal Algorithm
An algorithm for traversing binary trees in linear time using constant extra space is presented. The algorithm offers advantages to both Robson traversal and Lindstrom scanning. Under certain conditions, the algorithm can be applied to the marking of cyclic list structures. The algorithm can be generalized to handle N-trees and N-lists.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1991
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90026-e